Faster Worst Case Deterministic Dynamic Connectivity
نویسندگان
چکیده
We present a deterministic dynamic connectivity data structure for undirected graphs with worst case update time O (√ n(log logn)2 logn ) and constant query time. This improves on the previous best deterministic worst case algorithm of Frederickson (SIAM J. Comput., 1985) and Eppstein Galil, Italiano, and Nissenzweig (J. ACM, 1997), which had update time O( √ n). All other algorithms for dynamic connectivity are either randomized (Monte Carlo) or have only amortized performance guarantees. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems, G.2.2 Graph Theory
منابع مشابه
Faster Worst-Case Update Time for Dynamic Subgraph Connectivity
Real-world networks are prone to breakdowns. Typically in the underlying graph G, besides the insertion or deletion of edges, the set of active vertices changes overtime. A vertex might work actively, or it might fail, and gets isolated temporarily. The active vertices are grouped as a set S. S is subjected to updates, i.e., a failed vertex restarts, or an active vertex fails, and gets deleted ...
متن کاملFaster Deterministic Fully-Dynamic Graph Connectivity
We give new deterministic bounds for fully-dynamic graph connectivity. Our data structure supports updates (edge insertions/deletions) in O(log n/ log logn) amortized time and connectivity queries in O(log n/ log logn) worst-case time, where n is the number of vertices of the graph. This improves the deterministic data structures of Holm, de Lichtenberg, and Thorup (STOC 1998, J.ACM 2001) and T...
متن کاملMaintaining Minimum Spanning Forests in Dynamic Graphs
We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time o( √ n) per operation. To be precise, the algorithm uses O(n1/3 logn) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and bipartiteness in amortized time O(n1...
متن کاملMaintaining Minimum Spanning Trees in Dynamic Graphs
We present the first fully dynamic algorithm for maintaining a minimum spanning tree in time o( √ n) per operation. To be precise, the algorithm uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. An immediate consequence is the first fully dynamic deterministic algorithm for maintaining connectivity and, bipartiteness in amortized time O(n1...
متن کاملDynamic graph connectivity with improved worst case update time and sublinear space
This paper considers fully dynamic graph algorithms with both faster worst case update time and sublinear space. The fully dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes, process an online sequence of edge insertions, edge deletions, and queries of the form “Is there a path between nodes a and b?” In 2013, the first data structure was presented with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016